Refinement and Separation Contexts

نویسندگان

  • Ivana Mijajlovic
  • Noah Torp-Smith
  • Peter W. O'Hearn
چکیده

A separation context is a client program which does not dereference internals of the module with which it interacts. We use precise relations to unambiguously describe the storage of the module. We prove that separation contexts preserve such relations, as well as interesting properties of separation contexts in connection with refinement.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Analysis of Family Contexts Leading to Self-Harm among Female Students in Yazd

Introduction: The family traditionally has special supportive care functions; However, in recent times, this social institution, along with increasing the fluidity of public culture, has faced significant functional challenges. Among them is the inability of the family to control adolescents formally and informally, which results in general abnormalities such as self-harm. This study aimed to i...

متن کامل

Refinement-based Specification and Security Analysis of Separation Kernels

Assurance of information-flow security by formal methods is mandated in security certification of separation kernels. As an industrial standard for improving safety, ARINC 653 has been complied with by mainstream separation kernels. Due to the new trend of integrating safe and secure functionalities into one separation kernel, security analysis of ARINC 653 as well as a formal specification wit...

متن کامل

Safe Modification of Pointer Programs in Refinement Calculus

This paper discusses stepwise refinement of pointer programs in the framework of refinement calculus. We augment the underlying logic with formulas of separation logic and then introduce a pair of new predicate transformers, called separating assertion and separating assumption. The new predicate transformers are derived from separating conjunction and separating implication, which are fundamen...

متن کامل

Explanation by refinement and linearisability of two non-blocking shared-variable communication algorithms

Simpson and Harris have described multi-slot algorithms implementing a single-place buffer, each operating without explicit hardware synchronisation mechanisms. Conventional refinement and proof techniques have explained that these algorithms work, but not how they work. An unconventional refinement process starting from the classic single-variable buffer, using both data and atomicity refineme...

متن کامل

Evolving Specification Engineering

The motivation for this work is to support a natural separation of concerns during formal system development. In a developmentby-refinement context, we would like to be able to first treat basic functionality and normal-case behavior, and then later add in complicating factors such as physical limitations (memory, time, bandwidth, hardware reliability, and so on) and security concerns. Handling...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004